A New Representation for Exact Real Numbers 1 Abbas
نویسندگان
چکیده
We develop the theoretical foundation of a new representation of real numbers based on the innnite composition of linear fractional transformations (lft), equivalently the innnite product of matrices, with non-negative coeecients. Any rational interval in the one point compactiication of the real line, represented by the unit circle S 1 , is expressed as the image of the base interval 0; 1] under an lft. A sequence of shrinking nested intervals is then represented by an innnite product of matrices with integer coeecients such that the rst so-called sign matrix determines an interval on which the real number lies. The subsequent so-called digit matrices have non-negative integer coeecients and successively reene that interval. Based on the classiication of lft's according to their conjugacy classes and their geometric dynamics, we show that there is a canonical choice of four sign matrices which are generated by rotation of S 1 by =4. Furthermore, the ordinary signed digit representation of real numbers in a given base induces a canonical choice of digit matrices.
منابع مشابه
New Representation for Exact Real Numbers 1
We develop the theoretical foundation of a new representation of real numbers based on the innnite composition of linear fractional transformations (lft), equivalently the innnite product of matrices, with non-negative coeecients. Any rational interval in the one point compactiication of the real line, represented by the unit circle S 1 , is expressed as the image of the base interval 0; 1] und...
متن کاملA New Representation for Exact Real Numbers 1
We develop the theoretical foundation of a new representation of real numbers based on the in nite composition of linear fractional transformations (lft), equivalently the in nite product of matrices, with non-negative coe cients. Any rational interval in the one point compacti cation of the real line, represented by the unit circle S1, is expressed as the image of the base interval [0;1] under...
متن کاملTwo Algorithms for Root Finding in
We present two algorithms for computing the root, or equivalently the xed point, of a function in exact real arithmetic. The rst algorithm uses the iteration of the expression tree representing the function in real arithmetic based on linear fractional transformations and exact oating point. The second and more general algorithm is based on a trisection of intervals and can be compared with the...
متن کاملA domain - theoretic approach to computabilityon the real line 1
In recent years, there has been a considerable amount of work on using continuous domains in real analysis. Most notably are the development of the generalized Riemann integral with applications in fractal geometry, several extensions of the programming language PCF with a real number data type, and a framework and an implementation of a package for exact real number arithmetic. Based on recurs...
متن کاملSemantics of Exact Real Arithmetic
In this paper, we incorporate a representation of the non-negative extended real numbers based on the composition of linear fractional transformations with non-negative integer coeecients into the Programming Language for Computable Functions (PCF) with products. We present two models for the extended language and show that they are computationally adequate with respect to the operational seman...
متن کامل